Patch Layout from Feature Graph

نویسندگان

  • Matthias Nieser
  • Konrad Polthier
  • Christian Schulz
چکیده

Structuring of surface meshes is a labor intensive task in reverse engineering. For example in CAD, scanned triangle meshes must be divided into characteristic/uniform patches to enable conversion into high-level spline surfaces. Typical industrial techniques, like rolling ball blends, are very labor intensive. We provide a novel, robust and quick algorithm for the automatic generation of a patch layout based on a topology consistent feature graph. The graph separates the surface along feature lines into functional and geometric building blocks. Our algorithm then thickens thickens the edges of the feature graph and forms new regions with low varying curvature. Further these new regions so called fillets and node patches will have highly smooth boundary curves making it an ideal preprocessor for a subsequent spline fitting algorithm.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Edge Labeling in the Graph Layout Toolkit

The Graph Layout Toolkit is a family of portable graph drawing and layout libraries designed for integration into graphical user interface application programs. When visualizing graphs, it becomes essential to communicate the meaning of each graphical feature via text labels. We present the interface and the basic engine of the Graph Layout Toolkit that produce a high quality automated placemen...

متن کامل

Automated Transplantation of Call Graph and Layout Features into Kate

We report the automated transplantation of two features currently missing from Kate: call graph generation and automatic layout for C programs, which have been requested by users on the Kate development forum. Our approach uses a lightweight annotation system with Search Based techniques augmented by static analysis for automated transplanting. The results are promising: on average, our tool re...

متن کامل

TopoLayout: Graph Layout by Topological Features

We describe a new multi-level algorithm to draw graphs based on the topological features they contain. Topological features are recursively detected and their subgraphs are collapsed into single nodes, forming a graph hierarchy. Once the hierarchy is computed, we draw the subgraphs of the hierarchy, using an appropriate algorithm for each topological feature. Our layout algorithms are areaaware...

متن کامل

Grouse: Feature-Based, Steerable Graph Hierarchy Exploration

Grouse is a feature-based approach to steerable exploration of a graph and an associated hierarchy. Steerability allows exploration to begin immediately, rather than requiring a costly layout of the entire graph as an initial step. In a feature-based approach, the subgraph inside a metanode of the graph hierarchy is laid out with a wellchosen algorithm appropriate for its topological structure....

متن کامل

Automatic graph construction of periodic open tubulene ((5,6,7)3) and computation of its Wiener, PI, and Szeged indices

The mathematical properties of nano molecules are an interesting branch of nanoscience for researches nowadays. The periodic open single wall tubulene is one of the nano molecules which is built up from two caps and a distancing nanotube/neck. We discuss how to automatically construct the graph of this molecule and plot the graph by spring layout algorithm in graphviz and netwrokx packages. The...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009